Categories
Formal languages
Topic: Category
From HandWiki - Reading time: 3 min
Here is a list of articles in the Formal languages category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 7 subcategories, out of 7 total.
Pages in category "Formal languages"
The following 200 pages are in this category, out of 213 total.
(previous page) (next page)A
- Abstract family of acceptors
- Abstract family of languages
- Abstract rewriting system
- Abstract semantic graph
- Abstract syntax tree
- Action algebra
- Adaptive grammar
- Affix grammar
- Agent Communications Language
- Algorithmic learning theory
- Alphabet (formal languages)
- Ambiguous grammar
- Antimatroid
- Arden's Rule
- Arden's rule
- Attribute grammar
- Augmented Backus–Naur form
- Autocorrelation (words)
C
- Categorial grammar
- Chomsky hierarchy
- Chomsky normal form
- Chomsky–Schützenberger enumeration theorem
- Chomsky–Schützenberger representation theorem
- Closest string
- Compact semigroup
- Compiler Description Language
- Concatenation
- Cone (formal languages)
- Conference on Implementation and Application of Automata
- Conjunctive grammar
- Context change potential
- Context-free grammar
- Context-free language
- Context-sensitive grammar
- Context-sensitive language
- Controlled grammar
- Convolution (computer science)
- Critical exponent of a word
- Cross-serial dependencies
- Cyclic language
D
- Definite clause grammar
- Dershowitz–Manna ordering
- Descriptional Complexity of Formal Systems
- Descriptive interpretation
- Deterministic context-free grammar
- Deterministic context-free language
- Deterministic pushdown automaton
- Software:Diff
- Discontinuous-constituent phrase structure grammar
- Dyck congruence
- Dyck language
- Dynamic syntax tree
E
F
G
I
L
- L-attributed grammar
- L-system
- Language equation
- Language identification in the limit
- Left recursion
- Leftist grammar
- Lexical grammar
- Linear grammar
- Literal movement grammar
- LL grammar
- Local language (formal language)
- Locally catenative sequence
- Longest increasing subsequence
- Longest repeated substring problem
- LR-attributed grammar
M
P
- Parikh's theorem
- Parser combinator
- Parser Grammar Engine
- Parsing expression grammar
- Pattern language (formal languages)
- Picture language
- Post canonical system
- Prefix grammar
- Production (computer science)
- Profinite word
- Proof (truth)
- Pumping lemma for context-free languages
- Pumping lemma for regular languages
R
S
- S-attributed grammar
- Software:SCIgen
- Semantics encoding
- Semi-Thue system
- Sesquipower
- Set constraint
- Shamir congruence
- Shortest common supersequence
- Shortest common supersequence problem
- Signed-digit representation
- Simple precedence grammar
- SLR grammar
- Smallest grammar problem
- Sparse language
- Splicing rule
- Square-free word
- Biography:Ludwig Staiger
- Star height
- Star height problem
- Star-free language
- Probabilistic context-free grammar
- Stochastic language
- Straight-line grammar
- String (computer science)
- String operations
- Substring
- Symbol (formal)
- Synchronous context-free grammar
- Syntactic monoid
- Syntactic predicate
- Philosophy:Syntax (logic)
- Syntax diagram
- Formal system
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Category:Formal_languages12 views | ↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF